DBac: deadline based data collection using CSMA/CD and earliest deadline first (EDF) scheduling in wireless sensor network

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

End-to-End Statistical Delay Guarantees using Earliest Deadline First (EDF) Packet Scheduling

This paper develops a framework for statistically guaranteeing end-to-end delay bounds to envelopeconstrained connections transporting real-time traffic in a network of switches employing the Earliest Deadline First (EDF) packet scheduling scheme in conjunction with per-hop traffic shaping. The performance of an isolated EDF scheduler fed by markovian sources has been studied earlier in the lit...

متن کامل

RED: Robust Earliest Deadline Scheduling

In this paper we introduce a robust earliest deadline scheduling algorithm for dealing with sporadic tasks under overloads in a hard real-time environment. The algorithm synergistically combines many features including a very important minimum level of guarantee, dynamic guarantees, graceful degradation in overloads, deadline tolerance, resource reclaiming, and dynamic re-guarantees. A necessar...

متن کامل

A C-space sensitivity analysis of Earliest Deadline First scheduling

This paper presents a sensitivity analysis for the dimensioning of real-time systems in which sporadic tasks are executed according to the preemptive Earliest Deadline First (EDF) scheduling policy. The timeliness constraints of the tasks are expressed in terms of late termination deadlines. A general case is considered, where the task deadlines are independent of the task sporadicity intervals...

متن کامل

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

Lightweight EDF Scheduling with Deadline Inheritance

EDFI is a lightweight real-time scheduling protocol that combines EDF with deadline inheritance over shared resources. We will show that EDFI is flexible during a task’s admission control, efficient with scheduling and dispatching, and straightforward in feasibility analysis. The application programmer only needs to specify a task’s timing constraints (deadline, period, runtime) and resource ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Engineering & Technology

سال: 2018

ISSN: 2227-524X

DOI: 10.14419/ijet.v7i3.14522